Subgraph centrality and walk-regularity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgraph centrality in complex networks.

We introduce a new centrality measure that characterizes the participation of each node in all subgraphs in a network. Smaller subgraphs are given more weight than larger ones, which makes this measure appropriate for characterizing network motifs. We show that the subgraph centrality [C(S)(i)] can be obtained mathematically from the spectra of the adjacency matrix of the network. This measure ...

متن کامل

About the Discriminant Power of the Subgraph Centrality and Other Centrality Measures About the Discriminant Power of the Subgraph Centrality and Other Centrality Measures (Working paper)

Ernesto Estrada Department of Mathematics and Statistics, University of Strathclyde, Glasgow G1 1XH, UK The discriminant power of centrality indices for the degree, eigenvector, closeness, betweenness and subgraph centrality is analyzed. It is defined by the number of graphs for which the standard deviation of the centrality of its nodes is zero. On the basis of empirical analysis it is conclud...

متن کامل

Comment on "Subgraph centrality in complex networks".

We disprove a conjecture of Estrada and Rodríguez-Velázquez [Phys. Rev. E 71, 056103 (2005)] that if a graph has identical subgraph centrality for all nodes, then the closeness and betweenness centralities are also identical for all nodes.

متن کامل

Maximum walk entropy implies walk regularity

Article history: Received 2 March 2014 Accepted 18 June 2014 Available online 9 July 2014 Submitted by R. Brualdi MSC: 05C50 15A16 82C20

متن کامل

Random walk centrality for temporal networks

Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, as for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2019

ISSN: 0024-3795

DOI: 10.1016/j.laa.2019.02.005